Chemical trees minimizing energy and Hosoya index
نویسندگان
چکیده
منابع مشابه
Chemical Trees Minimizing Energy and Hosoya Index
Abstract. The energy of a molecular graph is a popular parameter that is defined as the sum of the absolute values of a graph’s eigenvalues. It is well known that the energy is related to the matching polynomial and thus also to the Hosoya index via a certain Coulson integral. Trees minimizing the energy under various additional conditions have been determined in the past, e.g., trees with a gi...
متن کاملar X iv : 0 80 4 . 05 16 v 1 [ m at h . C O ] 3 A pr 2 00 8 CHEMICAL TREES MINIMIZING ENERGY AND HOSOYA INDEX
Abstract. The energy of a molecular graph is a popular parameter that is defined as the sum of the absolute values of a graph’s eigenvalues. It is well known that the energy is related to the matching polynomial and thus also to the Hosoya index via a certain Coulson integral. Trees minimizing the energy under various additional conditions have been determined in the past, e.g., trees with a gi...
متن کاملExtremal trees with respect to Hosoya Index and Merrifield-Simmons Index
We characterize the trees T with n vertices whose Hosoya index (total number of matchings) is Z(T ) > 16fn−5 resp. the trees whose Merrifield-Simmons index (total number of independent subsets) is σ(T ) < 18fn−5 + 21fn−6, where fk is the kth Fibonacci number. It turns out that all the trees satisfying the inequality are tripodes (trees with exactly three leaves) and the path in both cases. Furt...
متن کاملExtremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
For any graph G, let m(G) and i(G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield–Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield–Simmons index, respectively. c © 2008 Elsevier B.V. All rights reserved.
متن کاملGraphs with maximal Hosoya index and minimal Merrifield-Simmons index
For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield-Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Chemistry
سال: 2008
ISSN: 0259-9791,1572-8897
DOI: 10.1007/s10910-008-9456-6